Mining Time-Sensitive Queries and their Sensitivities from Query Log
نویسندگان
چکیده
In this paper, we present a new concept called time-sensitive query. A query is time-sensitive if the set of relevant pages changes when the query is expanded with different temporal terms. Knowing which queries are time-sensitive and what sensitivities they have can be very useful in automatic query expansion for improving search effectiveness and user experience. Existing methods related to time-sensitive query detection are more sudden event oriented and have limitations in detecting other kinds of time-sensitive queries and in determining the time sensitivity. We propose an approach to detecting time-sensitive queries and determining their time sensitivities. Our experiment shows that the approach works well. The accuracy of time-sensitive query detection can reach 92% and the accuracy of time sensitivity calculation can reach 93.12%.
منابع مشابه
Fr{'e}chet and Hausdorff Queries on $x$-Monotone Trajectories
vspace{0.2cm}In this paper, we design a data structure for the following problem. Let $pi$ be an $x$-monotone trajectory with $n$ vertices in the plane and $epsilon >0$. We show how to preprocess $pi$ and $epsilon$ into a data structure such that for any horizontal query segment $Q$ in the plane, one can quickly determine the minimal continuous fraction of $pi$ whose Fr{'e}chet and Hausdo...
متن کاملDiscovering Popular Clicks\' Pattern of Teen Users for Query Recommendation
Search engines are still the most important gates for information search in internet. In this regard, providing the best response in the shortest time possible to the user's request is still desired. Normally, search engines are designed for adults and few policies have been employed considering teen users. Teen users are more biased in clicking the results list than are adult users. This leads...
متن کاملSemantic Search Log k-Anonymization with Generalized k-Cores of Query Concept Graph
Search log k-anonymization is based on the elimination of infrequent queries under exact (or nearly exact) matching conditions, which usually results in a big data loss and impaired utility. We present a more flexible, semantic approach to k-anonymity that consists of three steps: query concept mining, automatic query expansion, and affinity assessment of expanded queries. Based on the observat...
متن کاملبهبود الگوریتم انتخاب دید در پایگاه داده تحلیلی با استفاده از یافتن پرس وجوهای پرتکرار
A data warehouse is a source for storing historical data to support decision making. Usually analytic queries take much time. To solve response time problem it should be materialized some views to answer all queries in minimum response time. There are many solutions for view selection problems. The most appropriate solution for view selection is materializing frequent queries. Previously posed ...
متن کاملLearning to Mine Query Subtopics from Query Log
Many queries in web search are ambiguous or multifaceted. Identifying the major senses or facets of queries is very important for web search. In this paper, we represent the major senses or facets of queries as subtopics and refer to indentifying senses or facets of queries as query subtopic mining, where query subtopic are represented as a number of clusters of queries. Then the challenges of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017